-competitive Randomized Algorithm for Online Scheduling of Packets with Agreeable Deadlines
نویسندگان
چکیده
In 2005 Li et al. gave a φ-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines [12] with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek [7]. We claim that the algorithm by Li et al. can be slightly simplified, while retaining its competitive ratio. Then we introduce randomness to the modified algorithm and argue that the competitive ratio against oblivious adversary is at most 4 3 . Note that this still leaves a gap between the best known lower bound of 5 4 by Chin et al. [5] for randomized algorithms against oblivious adversary.
منابع مشابه
A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines
In 2005 Li et al. gave a φ-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines [12] with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek [7]. We claim that the algorithm by Li et al. can be slightly simplified, while retaining its competitive ratio. Then we introduce randomness to the modified algorithm and argue t...
متن کاملA 4 3-competitive randomised algorithm for online scheduling of packets with agreeable deadlines
In 2005 Li et al. gave a φ-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines [12] with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek [7]. We claim that the algorithm by Li et al. can be slightly simplified, while retaining its competitive ratio. Then we introduce randomness to the modified algorithm and argue t...
متن کاملAn Empirical Study of Online Packet Scheduling Algorithms
This work studies online scheduling algorithms for buffer management, develops new algorithms, and analyzes their performances. Packets arrive at a release time r, with a non-negative weight w and an integer deadline d. At each time step, at most one packet is scheduled. The modified greedy (MG) algorithm is 1.618-competitive for the objective of maximizing the sum of weights of packets sent, a...
متن کاملOnline Algorithms for Scheduling Weighted Packets with Deadlines in Bounded Buffers
We consider online algorithms for scheduling weighted packets with deadlines in multiple sizebounded buffers. There are m ≥ 1 buffers B1, B2, . . . , Bm. At any time, a buffer Bi can store at most bi ∈ Z packets. Packets arrive over time. Each packet is associated with a non-negative value, an integer deadline, and a target buffer that it can reside in. In each time step, only one pending packe...
متن کاملAlgorithms for Scheduling Weighted Packets with Deadlines in a Bounded Queue
Motivated by the Quality-of-Service (QoS) buffer management problem, we consider online scheduling of packets with hard deadlines in a finite capacity queue. At any time, a queue can store at most b ∈ Z packets. Packets arrive over time. Each packet is associated with a nonnegative value and an integer deadline. In each time step, only one packet is allowed to be sent. Our objective is to maxim...
متن کامل